量子计算的最新进展已显示出许多问题领域的有希望的计算优势。作为越来越关注的领域之一，混合量子古典机器学习系统已经证明了解决各种数据驱动的学习任务的能力。最近的作品表明，参数化的量子电路（PQC）可用于以可证明的学习优势来解决具有挑战性的强化学习（RL）任务。尽管现有的作品产生了基于PQC的方法的潜力，但PQC体系结构的设计选择及其对学习任务的影响通常没有得到充实。在这项工作中，我们介绍了基于PQC的模型EQAS-PQC，这是一种进化的量子体系结构搜索框架，该模型使用基于人群的遗传算法来通过探索量子操作的搜索空间来发展PQC体系结构。实验结果表明，我们的方法可以显着改善混合量子古典模型在解决基准增强问题方面的性能。我们还对量子操作的概率分布进行建模，以表现出色的体系结构，以识别对性能至关重要的基本设计选择。

词汇酶选择是一种语义感知的父次选择方法，它在随机抛弃的数据流中评估单个测试用例。它在多个研究领域表现出了成功，包括遗传编程，遗传算法以及最近的符号回归和深度学习。词汇酶选择及其变体的一个潜在缺点是，选择程序需要在单个数据流中评估培训案例，这使得很难处理评估在计算上很重的任务，或者数据集是大规模的，例如深度学习。在这项工作中，我们研究了如何采用加权洗牌方法来提高词汇酶选择的效率。我们提出了一种新颖的方法，即快速词汇酶选择，该方法结合了词汇酶选择和与部分评估的加权洗牌。对经典遗传编程和深度学习任务的实验表明，所提出的方法可以显着减少词汇酶选择所需的评估步骤的数量，从而提高其效率，同时保持效率。

一般计划的合成已成为遗传编程（GP）和人工智能的重要应用领域。代码构建遗传编程（CBGP）是最近引入的一般程序合成的GP方法，它利用反射和一级规格支持可能使用任意数据类型，多态性和从现有代码库中汲取的功能的程序的演变。但是，尚未报告正式描述和CBGP的彻底基准测试。在这项工作中，我们使用类型理论的算法对CBGP的方法进行形式化。特别是，我们表明，功能性编程语言和Hindley-Milner类型系统可用于使用原始CBGP纸中抽象描述的过程来发展类型安全程序。此外，与其他当代GP程序合成方法相比，我们对CBGP的该功能变体的搜索性能进行了全面分析。

近年来，预制语言模型彻底改变了NLP世界，同时在各种下游任务中实现了最先进的性能。但是，在许多情况下，当标记数据稀缺时，这些模型不会表现良好，并且预计模型将在零或几秒钟内执行。最近，有几项工作表明，与下游任务更好地对准的预先预测或执行第二阶段，可以导致改进的结果，尤其是在稀缺数据设置中。在此，我们建议利用携带的情绪话语标记来产生大规模的弱标记数据，这又可以用于适应语言模型进行情感分析。广泛的实验结果显示了我们在各种基准数据集中的方法的价值，包括金融域。在https://github.com/ibm/tslm-discourse-markers上提供代码，模型和数据。

我们介绍了用于有效索引字符串的RadixStringsPline（RSS）学习索引结构。RSS是一个基数树，每个索引固定数量的字节。RSS方法或超过传统字符串索引的性能，同时使用7-70 $ \ times $少的内存。RSS通过使用最小的字符串前缀来实现这一目标，以充分区分数据与索引整个字符串的大多数探测方法不同的数据。此外，RSS的界限错误性质加速了最后一英里的搜索，也可以启用内存有效的哈希表查找加速器。我们对艺术和热门的几个真实弦乐数据集进行基准RSS。我们的实验表明，这种研究线可能对未来的内存密集型数据库应用有望。

为什么普通语言模糊不清？我们认为，在合作扬声器没有完全了解世界的情况下，使用模糊表达可以在真实性（Gricean质量）和信息性之间提供最佳权衡（Gricean数量）。专注于诸如“周围”的近似的表达，这表明他们允许扬声器传达间接概率信息，这种信息可以使听众更准确地表示发言者可用的信息的信息。更精确的表达将是（之间的间隔“）。也就是说，模糊的句子可以比他们精确的对应物更有信息。我们对“周围”解释的概率处理，并提供了解释和使用“围绕” - 理性语音法（RSA）框架的典范。在我们的账户中，扬声器分配事项的形状不是由RSA框架标准用于模糊谓词的词汇不确定性模型的方式预测。我们利用我们的方法绘制关于模糊表达的语义灵活性的进一步教训及其对更精确的含义的不可缩短。

The 3D-aware image synthesis focuses on conserving spatial consistency besides generating high-resolution images with fine details. Recently, Neural Radiance Field (NeRF) has been introduced for synthesizing novel views with low computational cost and superior performance. While several works investigate a generative NeRF and show remarkable achievement, they cannot handle conditional and continuous feature manipulation in the generation procedure. In this work, we introduce a novel model, called Class-Continuous Conditional Generative NeRF ($\text{C}^{3}$G-NeRF), which can synthesize conditionally manipulated photorealistic 3D-consistent images by projecting conditional features to the generator and the discriminator. The proposed $\text{C}^{3}$G-NeRF is evaluated with three image datasets, AFHQ, CelebA, and Cars. As a result, our model shows strong 3D-consistency with fine details and smooth interpolation in conditional feature manipulation. For instance, $\text{C}^{3}$G-NeRF exhibits a Fr\'echet Inception Distance (FID) of 7.64 in 3D-aware face image synthesis with a $\text{128}^{2}$ resolution. Additionally, we provide FIDs of generated 3D-aware images of each class of the datasets as it is possible to synthesize class-conditional images with $\text{C}^{3}$G-NeRF.

Cellular automata (CA) captivate researchers due to teh emergent, complex individualized behavior that simple global rules of interaction enact. Recent advances in the field have combined CA with convolutional neural networks to achieve self-regenerating images. This new branch of CA is called neural cellular automata [1]. The goal of this project is to use the idea of idea of neural cellular automata to grow prediction machines. We place many different convolutional neural networks in a grid. Each conv net cell outputs a prediction of what the next state will be, and minimizes predictive error. Cells received their neighbors' colors and fitnesses as input. Each cell's fitness score described how accurate its predictions were. Cells could also move to explore their environment and some stochasticity was applied to movement.

There is a dramatic shortage of skilled labor for modern vineyards. The Vinum project is developing a mobile robotic solution to autonomously navigate through vineyards for winter grapevine pruning. This necessitates an autonomous navigation stack for the robot pruning a vineyard. The Vinum project is using the quadruped robot HyQReal. This paper introduces an architecture for a quadruped robot to autonomously move through a vineyard by identifying and approaching grapevines for pruning. The higher level control is a state machine switching between searching for destination positions, autonomously navigating towards those locations, and stopping for the robot to complete a task. The destination points are determined by identifying grapevine trunks using instance segmentation from a Mask Region-Based Convolutional Neural Network (Mask-RCNN). These detections are sent through a filter to avoid redundancy and remove noisy detections. The combination of these features is the basis for the proposed architecture.

Feature selection helps reduce data acquisition costs in ML, but the standard approach is to train models with static feature subsets. Here, we consider the dynamic feature selection (DFS) problem where a model sequentially queries features based on the presently available information. DFS is often addressed with reinforcement learning (RL), but we explore a simpler approach of greedily selecting features based on their conditional mutual information. This method is theoretically appealing but requires oracle access to the data distribution, so we develop a learning approach based on amortized optimization. The proposed method is shown to recover the greedy policy when trained to optimality and outperforms numerous existing feature selection methods in our experiments, thus validating it as a simple but powerful approach for this problem.